A Static Scheduling Heuristic for Heterogeneous Processors
نویسندگان
چکیده
17 SCHEDULING AND LOAD BALANCING This paper presented a static scheduling heuristic called best-imaginary-level(BIL) scheduling for heterogeneous processors. The input graph is an acyclic precedence graph, where a node has diierent execution times on diierent processors. The static level of a node, or BIL, incorporates the eeect of interprocessor communication (IPC) overhead and processor heterogeneity. The proposed scheduling technique is proven to produce the optimal scheduling result if the topology of the input task graph is linear. The proposed scheduling is expected to be applicable to the large span of target architectures from the network computing to the hardware/software codesign.
منابع مشابه
A new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems
Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...
متن کاملStatic Heuristic Processor Assignment in Heterogeneous Multiprocessors
It has been already demonstrated that cost-eeective multiprocessor designs may be obtained by combining in the same architecture processors of diierent speeds (heterogeneous architecture) so that the serial and critical portions of the application may beneet from a fast single processor. In such an environment, the problem of assigning tasks to processors becomes a very important one. This pape...
متن کاملList scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures
In the area of static scheduling, list scheduling is one of the most common heuristics for the temporal and spatial assignment of a directed acyclic graph (DAG) to a target system. As most scheduling heuristics, list scheduling assumes fully connected homogeneous processors and ignores contention on the communication links. This article extends the list scheduling heuristic for contention aware...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملScheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication
In a distributed computing environment, the schedule by which tasks are assigned to processors is critical to minimizing the overall run-time of the application. However, the problem of discovering the schedule that gives the minimum finish time is NP-Complete. This paper addresses static scheduling of a directed a-cyclic task graph (DAG) on a heterogeneous, bounded set of distributed processor...
متن کامل